Grover’s quantum searching algorithm is optimal
نویسندگان
چکیده
منابع مشابه
Grover’s quantum searching algorithm is optimal
I show that for any number of oracle lookups up to about π/4 √ N , Grover’s quantum searching algorithm gives the maximal possible probability of finding the desired element. I explain why this is also true for quantum algorithms which use measurements during the computation. I also show that unfortunately quantum searching cannot be parallelized better than by assigning different parts of the ...
متن کاملImperfect quantum searching algorithm
We point out that the criterion, derived by Long et al.[Phys. Rev A 61, 042305 (2000)], to judging the degree of inaccuracy under systematic errors in phase inversions in Grover’s quantum search algorithm is overestimated. Although this criterion is properly deduced, it lacks a more accurate characterization to the relation between systematic errors and the size of a quantum database. The crite...
متن کامل0 v 2 2 D ec 1 99 9 Grover ’ s quantum searching algorithm is optimal
I show that for any number of oracle lookups up to about π/4 √ N , Grover's quantum searching algorithm gives the maximal possible probability of finding the desired element. I explain why this is also true for quantum algorithms which use measurements during the computation. I also show that unfortunately quantum searching cannot be parallelized better than by assigning different parts of the ...
متن کاملAn Almost Optimal Algorithm for Unbounded Searching
Unbounded searching can be viewed as searching an ordered table of infinite size. In this paper we present an algorithm for unbounded searching and derive a lower bound on the number of comparisons required which shows that the algorithm is very nearly optimal. (Submitted to Information Processing Letters) * Work supported in part by U. S. Energy Research and Development Administration under co...
متن کاملShor’s Algorithm is Optimal
We show that the ‘standard’ quantum algorithm for the abelian hidden subgroup problem is not only efficient but is optimal in the information theoretic sense, in that it maximizes the probability of correctly identifying the hidden subgroup. The proof uses semidefinite programming to show that the standard algorithm implements the optimal set of measurements. The arguments break down for the no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 1999
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.60.2746